<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    53. Maximum Subarray
   </h1>
   <p>
    Given an integer array
    <code>
     nums
    </code>
    , find the contiguous subarray&nbsp;(containing at least one number) which has the largest sum and return its sum.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [-2,1,-3,4,-1,2,1,-5,4],
<strong>Output:</strong> 6
<strong>Explanation:</strong>&nbsp;[4,-1,2,1] has the largest sum = 6.
</pre>
   <p>
    <strong>
     Follow up:
    </strong>
   </p>
   <p>
    If you have figured out the O(
    <em>
     n
    </em>
    ) solution, try coding another solution using the divide and conquer approach, which is more subtle.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    53. 最大子序和
   </h1>
   <p>
    给定一个整数数组
    <code>
     nums
    </code>
    &nbsp;，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong> [-2,1,-3,4,-1,2,1,-5,4],
<strong>输出:</strong> 6
<strong>解释:</strong>&nbsp;连续子数组&nbsp;[4,-1,2,1] 的和最大，为&nbsp;6。
</pre>
   <p>
    <strong>
     进阶:
    </strong>
   </p>
   <p>
    如果你已经实现复杂度为 O(
    <em>
     n
    </em>
    ) 的解法，尝试使用更为精妙的分治法求解。
   </p>
  </div>
 </body>
</html>